Parallel and sequential computation on Boolean networks

Relations Among Parallel and Sequential Computation Models

This paper relates uniform small-depth circuit families as a parallel computation model with the complexity of polynomial time Turing machines. Among the consequences we obtain are: (a) a collapse of two circuit classes is equivalent to a relativizable collapse of the two corresponding polynomial time classes; and (b) a collapse of uniformity conditions for small depth circuits is equivalent to...

Primitives of Sequential and Parallel Computation

Rapid computation and interpretation of Boolean attractors in biological networks

Biological networks comprise myriad interactions between signalling molecules, genes and proteins. Information is transmitted and processed through such networks decide cellular fate. Determining if certain cellular fates are correlated to disease conditions has important bearing in biological and clinical research but the complexity is overwhelming. As recourse, biological networks may be repr...

Parallel neural networks for learning sequential procedures.

Recent studies have shown that multiple brain areas contribute to different stages and aspects of procedural learning. On the basis of a series of studies using a sequence-learning task with trial-and-error, we propose a hypothetical scheme in which a sequential procedure is acquired independently by two cortical systems, one using spatial coordinates and the other using motor coordinates. They...

Sequential Convergences on Generalized Boolean Algebras

In this paper we investigate convergence structures on a generalized Boolean algebra and their relations to convergence structures on abelian lattice ordered groups.